Analysis and Design of First-Order Distributed Optimization Algorithms Over Time-Varying Graphs
نویسندگان
چکیده
منابع مشابه
Modeling and Analysis of Time-Varying Graphs
We live in a world increasingly dominated by networks – communications, social, information, biological etc. A central attribute of many of these networks is that they are dynamic, that is, they exhibit structural changes over time. While the practice of dynamic networks has proliferated, we lag behind in the fundamental, mathematical understanding of network dynamism. Existing research on time...
متن کاملLearning Combinatorial Optimization Algorithms over Graphs
Many combinatorial optimization problems over graphs are NP-hard, and require significant specialized knowledge and trial-and-error to design good heuristics or approximation algorithms. Can we automate this challenging and tedious process, and learn the algorithms instead? In many real world applications, it is typically the case that the same type of optimization problem is solved again and a...
متن کاملCommutativity of First-order Discrete-Time Linear Time-varying Systems
After introducing the concept of commutativity for continuous-time linear time-varying systems, the related literature and the results obtained so far are presented. For a simple introduction of the commutativity of discrete-time linear time-varying systems, the problem is formulated for first-order systems. Finally, explicit necessary and sufficient conditions for the commutativity of first-or...
متن کاملStability and Robust Performance Analysis of Fractional Order Controller over Conventional Controller Design
In this paper, a new comparative approach has been proposed for reliable controller design. Scientists and engineers are often confronted with the analysis, design, and synthesis of real-life problems. The first step in such studies is the development of a 'mathematical model' which can be considered as a substitute for the real problem. The mathematical model is used here as a plant. Fractiona...
متن کاملDistributed Non-Convex First-Order Optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms
We consider a class of distributed non-convex optimization problems often arises in modern distributed signal and information processing, in which a number of agents connected by a network G collectively optimize a sum of smooth (possibly non-convex) local objective functions. We address the following fundamental question: For a class of unconstrained non-convex problems with Lipschitz continuo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2020
ISSN: 2325-5870,2372-2533
DOI: 10.1109/tcns.2020.2988009